﻿#include <iostream>

using namespace std;
const int N = 1010;
int arr[N][N];
long long dp[N][N];
int n, m, q;

int main()
{
	cin >> n >> m >> q;
	// 读⼊数据
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			cin >> arr[i][j];

	// 处理前缀和矩阵
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
			+ arr[i][j] - dp[i - 1][j - 1];

	// 使⽤前缀和矩阵
	int x1, y1, x2, y2;
	while (q--)
	{
		cin >> x1 >> y1 >> x2 >> y2;
		cout << dp[x2][y2] - dp[x1 - 1][y2] - dp[x2][y1 - 1]
			+ dp[x1 - 1][y1 - 1] << endl;
	}
}